Lax extensions of coalgebra functors and their logic
نویسندگان
چکیده
We discuss the use of relation lifting in the theory of set-based coalgebra and coalgebraic logic. On the one hand we prove that the neighborhood functor does not extend to a relation lifting of which the associated notion of bisimilarity coincides with behavioral equivalence. On the other hand we argue that relation liftings may be of use for many other functors that do not preserve weak pullbacks, such as the monotone neighborhood functor. We prove that for any relation lifting L that is a lax extension extending the coalgebra functor T and preserving diagonal relations, L-bisimilarity captures behavioral equivalence. We also show that a finitary T admits such an extension iff it has a separating set of finitary monotone predicate liftings. Finally, we present the coalgebraic logic, based on a cover modality, for an arbitrary lax extension.
منابع مشابه
Lax Extensions of Coalgebra Functors
We discuss the use of relation lifting in the theory of setbased coalgebra. On the one hand we prove that the neighborhood functor does not extend to a relation lifting of which the associated notion of bisimilarity coincides with behavorial equivalence. On the other hand we argue that relation liftings may be of use for many other functors that do not preserve weak pullbacks, such as the monot...
متن کاملLogic programming: laxness and saturation
A propositional logic program P may be identified with a PfPf -coalgebra on the set of atomic propositions in the program. The corresponding C(PfPf )coalgebra, where C(PfPf ) is the cofree comonad on PfPf , describes derivations by resolution. That correspondence has been developed to model first-order programs in two ways, with lax semantics and saturated semantics, based on locally ordered ca...
متن کاملCoalgebraic Semantics for Derivations in Logic Programming
Every variable-free logic program induces a PfPf -coalgebra on the set of atomic formulae in the program. The coalgebra p sends an atomic formula A to the set of the sets of atomic formulae in the antecedent of each clause for which A is the head. In an earlier paper, we identified a variable-free logic program with a PfPf -coalgebra on Set and showed that, if C(PfPf ) is the cofree comonad on ...
متن کاملUniform Interpolation for Coalgebraic Fixpoint Logic
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under projection, which is known to hold for weak-pullback preserving functors, to a more general class of functors, i.e.; functors with quasi-functorial...
متن کاملExtensions in the theory of lax algebras
Recent investigations of lax algebras—in generalization of Barr’s relational algebras—make an essential use of lax extensions of monad functors on Set to the category Rel(V) of sets and V-relations (where V is a unital quantale). For a given monad there may be many such lax extensions, and different constructions appear in the literature. The aim of this article is to shed a unifying light on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 81 شماره
صفحات -
تاریخ انتشار 2015